Non-actualized TheoryMUNDHENK, M.Philosophy and social Criticism anc Cultural Hermeneutics Chestnut Hill, Mass. 1980, Vol 7, Num 1, pp 55-70Article

On hard instancesMUNDHENK, M.Theoretical computer science. 2000, Vol 242, Num 1-2, pp 301-311, issn 0304-3975Article

The Notion of Education in the I Ching and the Li ChiMUNDHENK, M.Chinese Culture Yang Ming Shang. 1979, Vol 20, Num 1, pp 79-93Article

Monotonous and randomized reductions to sparse setsARVIND, V; KÖBLER, J; MUNDHENK, M et al.Informatique théorique et applications (Imprimé). 1996, Vol 30, Num 2, pp 155-179, issn 0988-3754Conference Paper

NP-hard sets have many hard instancesMUNDHENK, M.Lecture notes in computer science. 1997, pp 428-437, issn 0302-9743, isbn 3-540-63437-1Conference Paper

On reductions to sets that avoid EXPSPACEARVIND, V; KÖBLER, J; MUNDHENK, M et al.Information processing letters. 1995, Vol 56, Num 2, pp 109-114, issn 0020-0190Article

Nondeterministic instance complexity and hard-to-prove tautologiesARVIND, V; KÖBLER, J; MUNDHENK, M et al.Lecture notes in computer science. 2000, pp 314-323, issn 0302-9743, isbn 3-540-67141-2Conference Paper

Optimal non-approximability of MAXCLIQUEMUNDHENK, M; SLOBODOVA, A.Lecture notes in computer science. 1998, pp 235-248, issn 0302-9743, isbn 3-540-64201-3Conference Paper

The complexity of policy evaluation for finite-horizon partially-observable Markov decision processesMUNDHENK, M; GOLDSMITH, J; ALLENDER, E et al.Lecture notes in computer science. 1997, pp 129-138, issn 0302-9743, isbn 3-540-63437-1Conference Paper